Mathematical Formulation of a Linear Programming Problem

IMPORTANT

Mathematical Formulation of a Linear Programming Problem: Overview

This topic covers concepts, such as, Linear Programming Problems, Linear Programming, Graphical Solution of Two Variable Linear Programming Problem (Corner Point Method) & Linear Programming Problems Having Infeasible Solution etc.

Important Questions on Mathematical Formulation of a Linear Programming Problem

EASY
IMPORTANT

The feasible region for an LPP is always a _____ polygon.

HARD
IMPORTANT

A small firm manufactures necklace and bracelets. The total number of necklace and bracelet that it can handle per day is at most 24. It takes 1hour to make a bracelet and half an hour to make a necklace. The maximum number of hours available per day is 16. If the profit on a necklace is 100 and that on a bracelet is 300, how many of each should be produced daily to maximize the profit? It is being given that at least one of each must be produced.

HARD
IMPORTANT

Mr.Dass wants to invest 12000 in public provident fund (PPF) and in national bonds. He has to invest at least 1000 in PPF and at least 2000 in bonds. If the rate of interest on PPF is 12% per annum and that on bonds is 15% per annum, how should he invest the money to earn maximum annual income? Also find the maximum annual income.

MEDIUM
IMPORTANT

For the following Linear Programming problems with given constraints 4x+6y60, 2x+y20 and x0, y0. The maximum value of z=2x+3y is

MEDIUM
IMPORTANT

For the following linear Programming problems, subject to the constraints x+y4 and x0 , y0. Find the maximum value of Z=3x+4y

MEDIUM
IMPORTANT

For the following linear Programming problem, subject to the constraints x+2y83x+2y12 and x0 , y0. Find the minimum value of Z=-3x+4y.

EASY
IMPORTANT

Any point in the _____ region that gives the optimal value (maximum or minimum) of the objective function is called an optimal solution.

HARD
IMPORTANT

For the following linear programming problem, find the minimum value of z=8000x+12000y,  where constraints are 

3x+4y60

x+3y30

x0, Y0

EASY
IMPORTANT

The region of feasible solution under the constraints 2x+y6, x0, y0 is:

HARD
IMPORTANT

Solve the following problem graphically :

Minimise and Maximise

Z=3x+9y

Subject to the constraints :

x+3y60

x+y10

xy

x0, y0.

HARD
IMPORTANT

For the following linear programming problem:

Objective function: z=150x+250y

Subject to: 4x+y40

3x+2y60

x0

y0

The maximum value of z is

HARD
IMPORTANT

For the following L.P.P. Problem, the minimum value of z is

Minimize z=8x+10y, subject to 2x+y7, 2x+3y15, y2, x0, y0.

HARD
IMPORTANT

Maximise z=4x+y

Subject to constraints:

x+y50

3x+y90

x0

y0

by graphical method.

MEDIUM
IMPORTANT

For the following Linear Programming problems with given constraints

4x+6y60, 2x+y20 and x0, y0

The maximum value of z=2x+3y is

MEDIUM
IMPORTANT

Maximize z=x+2y subject to x+2y502x-y02x+y100x, y>0.

HARD
IMPORTANT

Prizes are to be distributed among the students of class XI and class XII. It is decided that at least 5 students from class XI and at least 4 students from class XII should get the prizes.The prize amount for class XI students is Rs 300 and that for the class XII students is Rs 400. The total number of prize holders should not be less than 10 and more than 15. How many students from each standard be selected to maximise the amount of prize money?

HARD
IMPORTANT

Prizes are to be distributed among the students of class XI and class XII. It is decided that at least 5 students from class XI and at least 4 students from class XII should get the prizes.The prize amount for class XI students is Rs 300 and that for the class XII students is Rs 400. The total number of prize holders should not be less than 10 and more than 15. How many students from each standard be selected to minimise the amount of prize money?

HARD
IMPORTANT

If a motorcyclist rides his motorcycle at 30 km per hour, he has to spend Rs 3 per km on petrol. If he rides at a faster speed of 50 km per hour, the petrol cost increases to Rs 5 per km. He has Rs 150 to spend on petrol and wishes to travel the maximum distance within an hour. Express this as LPP and solve it graphically.

HARD
IMPORTANT

A farmer mixes two brands A and B of cattle feed. Brand A, costing 500 ₹  per bag, contains 6 units of nutritional element P, 5 units of element Q and 4 units of element R. Brand B costing  400 ₹ per bag contains 3 units of nutritional element P, 2.5 units of element Q and 6 units of element R. The minimum requirements of P,Q & R  are 36,25 & 48 units respectively. Determine the number of bags of each brand that should be mixed in order to produce a mixture having a minimum cost per bag. What is the minimum cost of the mixture per bag?

HARD
IMPORTANT

A company manufactures two types of hats, A and B. Market survey has indicated that the combined production level should not exceed 1200 hats per week and the demand for hats of type B is at most half of that for hats of type A. Further, the production level of hats of type A can exceed three times the production of hats of type B by at most 600 units. The company makes the profit of 24 ₹  and 32 ₹  per hat of type A&B respectively. How many hats of each type should be produced weekly in order to maximize the profit?